Description: 一个根据给定的图，计算出最小生成树的程序-according to a set plan, the calculated minimum spanning tree procedures Platform: |
Size: 145408 |
Author:胡云 |
Hits:
Description: kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process. Platform: |
Size: 1024 |
Author:涂奎 |
Hits:
Description: 最小生成树的kruskal算法,我的数据结构课程设计的源代码，很好用。-the Kruskal minimum spanning tree algorithm, the data structure of curriculum design source code, with very good. Platform: |
Size: 7168 |
Author:胡冰 |
Hits:
Description: 关于最小生成树问题的基本思想运行结果测试平台以及源码-minimum spanning tree problem on the basic idea of operating results and the source test platform Platform: |
Size: 7168 |
Author:wjf |
Hits:
Description: 包括最短路及最小生成树算法，对于参加建模很有用的-including the most short-circuit and the minimum spanning tree algorithm, for participating in modeling very useful Platform: |
Size: 4096 |
Author:笑我多情 |
Hits:
Description: 在boost基础上实现
对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree. Platform: |
Size: 2048 |
Author: |
Hits:
Description: 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface! Platform: |
Size: 81920 |
Author:陈青侠 |
Hits:
Description: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes! Platform: |
Size: 1024 |
Author:gao |
Hits:
Description: 利用克鲁斯卡尔算法求网的最小生成树
是关于数据结构的课程设计的题目
是非常有用的-Kelushikaer algorithm for the use of the network is the minimum spanning tree data structure of the curriculum design is the subject of very useful Platform: |
Size: 1024 |
Author: |
Hits:
Description: 2005年电力部数学建模大赛题目：
共有61个比赛项目，1050人参加比赛。请给出算法及其框图，同时给出合理的比赛项目排序表，使连续参加两项比赛的运动员人次尽可能的少；表中“＃”号位置表示运动员参加此项比赛。建立此问题的数学模型，并且合理安排比赛项目顺序，使连续参加两项比赛的运动员人次尽可能的少；程序使用了最小生成树算法。-2005 Mathematical Modeling Contest subject : a total of 61 events, 1,050 people participate in the competition. Please give algorithm and its frame, the event is a reasonable ranking table to enable participation in two consecutive games of 000 athletes as less; Table "#" locations athletes this game. This established the mathematical model, and reasonable arrangements event sequence, and allows the two consecutive games of 000 athletes as less; Procedures for the use of the minimum spanning tree algorithm. Platform: |
Size: 36864 |
Author:容器 |
Hits:
Description: 利用prim算法来计算最小生成树,对于数据结构学习者有很大帮助,利用邻接矩阵来存储图-Prim algorithm used to calculate the minimum spanning tree, the data structure for the learner is very helpful to use the adjacency matrix storage plan Platform: |
Size: 169984 |
Author:赵麟 |
Hits:
Description: 用克鲁斯卡尔的算法实现最小生成树，用C语言来实现的。内容相当简练-Kelushikaer with the minimum spanning tree algorithm, using C language to achieve. Quite a concise Platform: |
Size: 1024 |
Author:王超 |
Hits:
Description: 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method Platform: |
Size: 1024 |
Author:杨翠 |
Hits:
Description: 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications Platform: |
Size: 1024 |
Author:小明 |
Hits:
Description: 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete. Platform: |
Size: 2048 |
Author:榔头 |
Hits:
Description: Kruskal算法和Prim算法
任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通).
加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和.
最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm
Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected).
The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and.
The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree. Platform: |
Size: 1024 |
Author:江洋 |
Hits:
Search - Minimum spanning tree